On Distance Properties of Convolutional Polar Codes
نویسندگان
چکیده
منابع مشابه
Convolutional Polar Codes
Arikan’s Polar codes [1] attracted much attention as the first efficiently decodable and capacity achieving codes. Furthermore, Polar codes exhibit an exponentially decreasing block error probability with an asymptotic error exponent upper bounded by β < 1 2 . Since their discovery, many attempts have been made to improve the error exponent and the finite block-length performance, while keeping...
متن کاملOn the Distance Growth Properties of Double Serially Concatenated Convolutional Codes
It has recently been shown that the minimum distance of the ensemble of repeat multiple accumulate codes grows linearly with block length. In this paper we present a method to obtain the minimum distance growth rate coefficient of double-serially concatenated codes and determine the growth coefficient of the rate 1/2 double serially concatenated code consisting of an outer memory-one convolutio...
متن کاملSerially Concatenated Convolutional Codes with Product Distance
J. Freudenberger*, R. Jordan*, M. Bossert*, and S. Shavgulidze** * University of Ulm, Dep. of Information Technology Albert-Einstein-Allee 43, D-89081 Ulm, Germany Email: jfreuden,jordan,[email protected] ** Georgian Technical University, Dep. of Digital Communication Theory Kostava str. 77, Tbilisi 380075, Georgia Email: sergo [email protected] Abstract: In this paper we investigate s...
متن کاملUnit Memory Convolutional Codes with Maximum Distance
Unit memory codes and in particular, partial unit memory codes are reviewed. Conditions for the optimality of partial unit memory codes with degree k− 1 are given, where optimal codes are the codes having the maximum free distance among all codes of the same parameters k,n and degree μ. A binary construction of unit memory codes with μ = k − 1 is discussed for the cases that satisfy the optimal...
متن کاملConvolutional codes with maximum distance profile
Maximum distance profile codes are characterized by the property that two trajectories which start at the same state and proceed to a different state will have the maximum possible distance from each other relative to any other convolutional code of the same rate and degree. In this paper we use methods from systems theory to characterize maximum distance profile codes algebraically. The main r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2019
ISSN: 0090-6778,1558-0857
DOI: 10.1109/tcomm.2019.2909213